Pro Jected Gradient Methods for Ncp 57 Projected Gradient Methods for Nonlinear Complementarity Problems via Normal Maps
نویسنده
چکیده
We present a new approach to solving nonlinear complementarity problems based on the normal map and adaptations of the projected gradient algorithm. We characterize a Gauss{Newton point for nonlinear complementarity problems and show that it is suucient to check at most two cells of the related normal manifold to determine such points. Our algorithm uses the projected gradient method on one cell and n rays to reduce the normed residual at the current point. Global convergence is shown under very weak assumptions using a property called nonstationary repulsion. A hybrid algorithm maintains global convergence, with quadratic local convergence under appropriate assumptions.
منابع مشابه
Globally convergent Jacobian smoothing inexact Newton methods for NCP
A new smoothing algorithm for the solution of nonlinear complementarity problems (NCP) is introduced in this paper. It is based on semismooth equation reformulation of NCP by Fischer–Burmeister function and its related smooth approximation. In each iteration the corresponding linear system is solved only approximately. Since inexact directions are not necessarily descent, a nonmonotone techniqu...
متن کاملProperties of a Class of Ncp-functions and a Related Semismooth Newton Method for Complementarity Problems
In this paper, we aim to explore properties of a class of NCP-functions and investigate a related semismooth Newton method for complementarity problems. Some favorite properties about the class of NCP-functions and its merit function are discussed including strong semismoothness, continuous differentiability and the nonsingularity of the element in C-subdifferential. In particular, we present a...
متن کاملThe Semismooth-Related Properties of a Merit Function and a Descent Method for the Nonlinear Complementarity Problem
This paper is a follow-up of the work [1] where an NCP-function and a descent method were proposed for the nonlinear complementarity problem. An unconstrained reformulation was formulated due to a merit function based on the proposed NCP-function. We continue to explore properties of the merit function in this paper. In particular, we show that the gradient of the merit function is globally Lip...
متن کاملLagrangian Globalization Methods for Nonlinear Complementarity Problems
This paper extends the Lagrangian globalization (LG) method to the nonsmooth equation Φ(x) = 0 arising from nonlinear complementarity problems NCP and presents a descent algorithm for the LG phase. The aim of this paper is not to present a new method for solving NCP, but to find x̂ such that ‖Φ(x̂)‖ < ‖Φ(x̄)‖ when the NCP has a solution and x̄ is a stationary point but not a solution.
متن کاملContinuation method for nonlinear complementarity problems via normal maps
In a recent paper by Chen and Mangasarian (C. Chen, O.L. Mangasarian, A class of smoothing functions for nonlinear and mixed complementarity problems, Computational Optimization and Applications 2 (1996), 97±138) a class of parametric smoothing functions has been proposed to approximate the plus function present in many optimization and complementarity related problems. This paper uses these sm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995